Private and Secure Public-Key Distance Bounding Application to NFC Payment — Short Paper Serge Vaudenay EPFL CH-1015 Lausanne, Switzerland http://lasec.epfl.ch

Source URL: fc15.ifca.ai

• Cryptography
• Computational complexity theory
• Distance-bounding protocol
• Public-key cryptography
• Complexity classes
• Proof of knowledge
• IP
• Challengeresponse authentication
• NP
• Digital signature
• Security parameter
• Negligible function

A Complexity Tradeoff in Ranking-Function Termination Proofs Amir M. Ben-Amram∗ April 25, 2008 Abstract

Source URL: www2.mta.ac.il

THE AUTOMORPHISM GROUP OF A SHIFT OF LINEAR GROWTH: BEYOND TRANSITIVITY VAN CYR AND BRYNA KRA Abstract. For a finite alphabet A and shift X ⊆ AZ whose factor complexity function grows at most linearly, we study the alg

Source URL: www.facstaff.bucknell.edu

Efficient Set Intersection with Simulation-Based Security Michael J. Freedman∗ Carmit Hazay† Kobbi Nissim‡

Source URL: www.eng.biu.ac.il

• Applied mathematics
• Quantum complexity theory
• Computational complexity theory
• Secure multi-party computation
• Communication complexity
• Secure two-party computation
• PP
• One-way function
• IP
• Cryptography
• Theoretical computer science
• Cryptographic protocols

Empirical and multiplier bootstrap for suprema of empirical processes of increasing complexity, and related Gaussian couplings. Victor Chernozhukova , Denis Chetverikovb , Kengo Katoc a

Source URL: www.econ.ucla.edu

• Continuous function
• Envelope
• Measure theory
• Fourier analysis
• Essential range
• Itō diffusion
• Mathematical analysis
• Mathematics
• Normal distribution

A heaviest hitters limiting mechanism with O(1) time complexity for sliding-window data streams Remous-Aris Koutsiamanis and Pavlos S. Efraimidis Department of Electrical and Computer Engineering Democritus University of

Source URL: www.spice-center.org

• Information science
• Linked list
• Hash table
• Stack
• Hash function
• Cuckoo hashing
• Time complexity
• Heap
• Search algorithms
• Theoretical computer science
• Applied mathematics

ESRC Seminar Series Complexity and Method in Social Sciences My Kingdom for a Function: What is gained by quantifying complex social science research? 9 May 2014 Humanities Building, H5.45

Source URL: blogs.cim.warwick.ac.uk

Compressive sensing using locality-preserving matrices Elyot Grant∗ Piotr Indyk∗ December 4, 2012

Source URL: people.csail.mit.edu

• Error detection and correction
• Information retrieval
• Artificial intelligence
• Computational complexity theory
• Universal hashing
• Lipschitz continuity
• Hash function
• Combinatory logic
• Tabulation hashing
• Search algorithms
• Hashing
• Theoretical computer science

When and How Can Data be Efficiently Released with Privacy? Cynthia Dwork Moni Naor∗ Omer Reingold Salil Vadhan

Source URL: www.wisdom.weizmann.ac.il

• Data privacy
• Applied probability
• Exponential mechanism
• Time complexity
• Differential privacy
• Constructible universe
• Polynomial
• Negligible function
• PP
• Theoretical computer science
• Mathematics
• Computational complexity theory

A Scalable and Nearly Uniform Generator of SAT Witnesses? Supratik Chakraborty1 , Kuldeep S. Meel2 , and Moshe Y. Vardi2 1 2

Source URL: www.cs.rice.edu

• Search algorithms
• Cryptographic hash functions
• Analysis of algorithms
• Probabilistic complexity theory
• Randomized algorithm
• PP
• Algorithm
• Hash function
• Universal hashing
• Theoretical computer science
• Applied mathematics
• Computational complexity theory